Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes
نویسنده
چکیده
In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound.
منابع مشابه
Burst Correction Coding From Low-Density Parity-Check Codes
BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملNew array codes for multiple phased burst correction
Abstmct-A new optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is presented. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts...
متن کاملConstruction and Performance of Quantum Burst Error Correction Codes for Correlated Errors
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, t...
متن کاملRandom error and burst correction by iterated codes
Error-correcting codes have contributed in a significant way for both the theoretical referred to as random errors, or else errors can appear in bursts of many errors each It was shown that long LDPC codes with iterative decoding achieve. LDPC codes provide good random error performance nearer to Shannon limit. iterations such errors can be corrected by concatenating LDPC codes with RS codes. b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1104.1408 شماره
صفحات -
تاریخ انتشار 2011